An Augmented Lagrangian Approach to Linearized Problems in Hydrodynamic Stability
نویسندگان
چکیده
منابع مشابه
An Augmented Lagrangian Approach to Linearized Problems in Hydrodynamic Stability
The solution of linear systems arising from the linear stability analysis of solutions of the Navier–Stokes equations is considered. Due to indefiniteness of the submatrix corresponding to the velocities, these systems pose a serious challenge for iterative solution methods. In this paper, the augmented Lagrangian-based block triangular preconditioner introduced by the authors in [2] is extende...
متن کاملAn Augmented Lagrangian Approach to Constrained MAP Inference An Augmented Lagrangian Aproach to Constrained MAP Inference
In this section, we derive in detail the closed form solution of problem (12) for binary pairwise factors (Sect. 4.1). Recall that the marginal polytope M(G a) is given by:
متن کاملFast Linearized Augmented Lagrangian Method for Euler’s Elastica Model
Recently, many variational models involving high order derivatives have been widely used in image processing, because they can reduce staircase effects during noise elimination. However, it is very challenging to construct efficient algorithms to obtain the minimizers of original high order functionals. In this paper, we propose a new linearized augmented Lagrangian method for Euler’s elastica ...
متن کاملAn Augmented Lagrangian-Based Approach to the Oseen Problem
We describe an effective solver for the discrete Oseen problem based on an augmented Lagrangian formulation of the corresponding saddle point system. The proposed method is a block triangular preconditioner used with a Krylov subspace iteration like BiCGStab. The crucial ingredient is a novel multigrid approach for the (1,1) block, which extends a technique introduced by Schöberl for elasticity...
متن کاملAn Augmented Lagrangian Approach to Constrained MAP Inference
We propose a new algorithm for approximate MAP inference on factor graphs, which combines augmented Lagrangian optimization with the dual decomposition method. Each slave subproblem is given a quadratic penalty, which pushes toward faster consensus than in previous subgradient approaches. Our algorithm is provably convergent, parallelizable, and suitable for fine decompositions of the graph. We...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2008
ISSN: 1064-8275,1095-7197
DOI: 10.1137/070691851